Tim Roughgarden - PDFSEARCH.IO - Document Search Engine

Tim Roughgarden
Results: 191

#	Item
71	CS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves∗ Tim Roughgarden† November 5, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-29 15:44:35 Operations research Mathematical optimization Mathematics Packing problems Mathematical analysis Academia Cryptography Knapsack problem Multi-objective optimization Pareto efficiency Probability distribution Pareto distribution
72	Designing Network Protocols for Good Equilibria∗ Ho-Lin Chen† Tim Roughgarden‡ Gregory Valiant§ Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2009-05-25 23:29:17 Game theory Computing Technology Price of stability Price of anarchy Digital media Nash equilibrium Internet protocol suite Routing Strategy Communications protocol Internet
73	CS364A: Algorithmic Game Theory Lecture #8: Combinatorial and Wireless Spectrum Auctions∗ Tim Roughgarden† October 16, 2013 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-22 16:31:53 Auction theory Auctions Game theory Marketing Market economics) Vickrey auction Auction VickreyClarkeGroves auction Spectrum auction English auction First-price sealed-bid auction Combinatorial auction
74	CS168: The Modern Algorithmic Toolbox Lecture #8: How PCA Works Tim Roughgarden & Gregory Valiant∗ April 20, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:44 Algebra Linear algebra Mathematics Matrices Matrix theory Numerical linear algebra Mathematical physics Eigenvalues and eigenvectors Principal component analysis Orthogonal matrix Singular value decomposition Diagonalizable matrix
75	CS364A: Algorithmic Game Theory Lecture #10: Kidney Exchange and Stable Matching∗ Tim Roughgarden† October 23, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-22 16:36:22 Graph theory Mathematics Matching Kidney transplantation Organ transplantation HopcroftKarp algorithm 3-dimensional matching
76	CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality∗ Tim Roughgarden† December 3, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-29 00:22:18 Operations research Algorithm Mathematical logic Theoretical computer science Mathematical optimization Academia Mathematics Applied mathematics Dynamic programming Randomized algorithms as zero-sum games Randomized rounding
77	From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡ Add to Reading List Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com Language: English - Date: 2012-07-04 18:28:36 Mathematical optimization Mathematics Operations research Linear programming Convex optimization Combinatorial optimization Computational complexity theory Submodular set function Randomized rounding Optimization problem Matroid Ellipsoid method
78	CS168: The Modern Algorithmic Toolbox Lecture #5: Gradient Descent Basics Tim Roughgarden & Gregory Valiant∗ April 11, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:43 Mathematical analysis Numerical analysis Mathematics Differential calculus Rates Vector calculus Convex analysis Gradient descent Convex optimization Mathematical optimization Derivative Normal
79	CS364B: Frontiers in Mechanism Design Lecture #8: MIR and MIDR Mechanisms∗ Tim Roughgarden† January 29, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-02-19 21:14:11 Mechanism design Computational complexity theory Game theory Decision theory VickreyClarkeGroves auction VickreyClarkeGroves mechanism Incentive compatibility Knapsack problem Randomized rounding Time complexity Random-sampling mechanism Bayesian-optimal mechanism
80	CS264: Beyond Worst-Case Analysis The Top 10 List∗ Tim Roughgarden† December 3, 2014 We covered a lot of concepts in this course. To appreciate this, let’s review the overarching narrative of the course via a top 1 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 18:09:21 Computational complexity theory Theory of computation Mathematics Analysis of algorithms Operations research Mathematical optimization NP-complete problems Smoothed analysis Algorithm Competitive analysis Best worst and average case Time complexity

UPDATE